1

Symbol different term rewrite systems

Year:
2015
Language:
english
File:
PDF, 668 KB
english, 2015
4

Variants of top-down tree transducers with look-ahead

Year:
1988
Language:
english
File:
PDF, 962 KB
english, 1988
9

On ground tree transformations and congruences induced by tree automata

Year:
2003
Language:
english
File:
PDF, 230 KB
english, 2003
10

Deterministic top-down tree transducers with iterated look-ahead

Year:
1995
Language:
english
File:
PDF, 1.42 MB
english, 1995
14

Losing recognizability

Year:
2007
Language:
english
File:
PDF, 228 KB
english, 2007
18

Tree shuffle

Year:
2014
Language:
english
File:
PDF, 424 KB
english, 2014
23

Top-down tree transducers with two-way tree walking look-ahead

Year:
1992
Language:
english
File:
PDF, 1.85 MB
english, 1992
24

Right-linear half-monadic term rewrite systems

Year:
2003
Language:
english
File:
PDF, 274 KB
english, 2003
28

Term rewriting restricted to ground terms

Year:
2003
Language:
english
File:
PDF, 405 KB
english, 2003
31

A property of left-linear rewrite systems preserving recognizability

Year:
2000
Language:
english
File:
PDF, 172 KB
english, 2000
34

CHAP and rewrite components

Year:
2011
Language:
english
File:
PDF, 482 KB
english, 2011
37

Intersection of finitely generated congruences over term algebra

Year:
2003
Language:
english
File:
PDF, 350 KB
english, 2003
38

Congruential complements of ground term rewrite systems

Year:
2000
Language:
english
File:
PDF, 224 KB
english, 2000
41

Murg term rewrite systems

Year:
2008
Language:
english
File:
PDF, 209 KB
english, 2008
47

Rewriting preserving recognizability of finite tree languages

Year:
2013
Language:
english
File:
PDF, 703 KB
english, 2013
48

Tree transducers with external functions

Year:
1993
Language:
english
File:
PDF, 3.41 MB
english, 1993
49

Deterministic bottom-up tree transducers and ground term rewrite systems

Year:
2009
Language:
english
File:
PDF, 2.03 MB
english, 2009